Using the Theorem Prover
نویسنده
چکیده
This paper describes experiments with the automated theorem prover SETHEO. The prover is applied to proof tasks which arise during formal design and speciication in Focus. These proof tasks originate from the formal development of a communication protocol (Stenning protocol). Its development and veriication in Focus is described in \C. Dendorfer, R. Weber: Development and Implementation of a Communication Protocol { An Exercise in Focus" DW92a]. A number of propositions of that paper deal with safety and liveness properties of the Stenning protocol on the level of traces. All given propositions and lemmata could be proven automatically using the theorem prover SETHEO. This paper gives a short introduction into the proof tasks as provided in DW92a]. All steps which were necessary to apply SETHEO to the given proof tasks (transformation of syntax, axiomatization) will be described in detail. The surprisingly good results obtained by SETHEO will be presented, and advantages and problems using an automated theorem prover for simple, but frequently occurring proof tasks during a formal development in Focus, as well as possibly ways for improvements for using SETHEO as a \back-end" for Focus will be discussed.
منابع مشابه
An example in NQTHM: Ramsey's Theorem
We present here a proof of Ramsey's Theorem for exponent 2 using the Boyer-Moore theorem prover. The presentation is intended to be in a style to assist those who want to learn how to improve their eeectiveness in using the Boyer-Moore logic and theorem prover.
متن کاملProbabilistic Analysis Using Theorem Proving
In this chapter, the authors first provide the overall methodology for the theorem proving formal probabilistic analysis followed by a brief introduction to the HOL4 theorem prover. The main focus of this book is to provide a comprehensive framework for formal probabilistic analysis as an alternative to less accurate techniques like simulation and paper-and-pencil methods and to other less scal...
متن کاملUse of a Theorem Prover for Transformational Synthesis
Transformational synthesis is the process of generating a hardware implementation from an initial behavioural description, by repeatedly applying transformations to the behavioural descriptions until a satisfactory implementation can be generated. It is essential to verify the correctness of the applied transformations if the final implementation is to conform to the initial specification. We h...
متن کاملUsing a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover
This paper describes the integration of a leading SAT solver with Isabelle/HOL, a popular interactive theorem prover. The SAT solver generates resolution-style proofs for (instances of) propositional tautologies. These proofs are verified by the theorem prover. The presented approach significantly improves Isabelle’s performance on propositional problems, and furthermore exhibits counterexample...
متن کاملDarr – a Theorem Prover for Constrained and Rational Default Logics
Default logics represent an important class of the nonmonotonic formalisms. Using simple by powerful inference rules, called defaults, these logic systems model reasoning patterns of the form ”in the absence of information to the contrary of. . . ”, and thus formalize the default reasoning, a special type of nonmonotonic reasoning. In this paper we propose an automated system, called DARR, with...
متن کامل